Supercharging the APGAS Programming Model with Relocatable Distributed Collections

Distributed programming in Scala with APGAS

APGAS (Asynchronous Partitioned Global Address Space) is a model for concurrent and distributed programming, known primarily as the foundation of the X10 programming language. In this paper, we present an implementation of this model as an embedded domain-specific language for Scala. We illustrate common usage patterns and contrast with alternative approaches available to Scala programmers. In ...

Performance Analysis of Lattice QCD Application with APGAS Programming Model

It is expected that the first exascale supercomputer will be deployed within the next 10 years, but the programming model which allows easy development and high performance is still unknown. APGAS programming model offers a flexible way for wide range of applications to express many patterns of concurrency, communication, and control through the combination of asynchronous operations and a glob...

Supercharging the Collections Function through Predictive Analytics

Distributed Barrier Coverage with Relocatable Sensors

A wireless sensor can detect the presence of an intruder in its sensing range, and is said to cover the portion of a given barrier that intersects with its sensing range. Barrier coverage is achieved by a set of sensors if every point on the barrier is covered by some sensor in the set. Assuming n identical, anonymous, and relocatable sensors are placed initially at arbitrary positions on a lin...

The Concurrent Collections Programming Model

We introduce the Concurrent Collections (CnC) programming model. In this model, programs are written in terms of high-level operations. These operations are partially ordered according to only their semantic constraints. These partial orderings correspond to data dependences and control dependences. The role of the domain expert, whose interest and expertise is in the application domain, and th...